Codes and designs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

some designs and codes from l_2(q)

for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159],...

متن کامل

some optimal codes from designs

the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.

متن کامل

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code — a subset of U(d) in which...

متن کامل

Designs and Codes: An update

Since the publication in 1992 of “Designs and their Codes” significant progress has been made in the general area of codes coming from designs. This article reviews this progress and presents some of the results — including confirmation of certain conjectures made and answers to some of the questions raised in the book.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1981

ISSN: 0097-3165

DOI: 10.1016/0097-3165(81)90012-1